算法书01.Algorithms

2023-03-25 03:04| 来源: 网络整理| 查看: 265

这个是基础，cracking是面试工具书

The textbook is organized into six chapters:

Chapter 1: Fundamentals introduces a scientific and engineering basis for comparing algorithms and making predictions. It also includes our programming model.Chapter 2: Sorting considers several classic sorting algorithms, including insertion sort, mergesort, and quicksort. It also features a binary heap implementation of a priority queue.Chapter 3: Searching describes several classic symbol-table implementations, including binary search trees, red–black trees, and hash tables.Chapter 4: Graphs surveys the most important graph-processing problems, including depth-first search, breadth-first search, minimum spanning trees, and shortest paths.Chapter 5: Strings investigates specialized algorithms for string processing, including radix sorting, substring search, tries, regular expressions, and data compression.Chapter 6: Context highlights connections to systems programming, scientific computing, commercial applications, operations research, and intractability.

【本文地址】

公司简介

联系我们